Fast algorithms for PDEs in simple and complex geometries
نویسندگان
چکیده
منابع مشابه
Fast algorithms for PDEs in simple and complex geometries
We review some fast and accurate numerical techniques for solving elliptic equations in complicated domains developed by the author and his colleagues in recent past. These are based on a combination of fast algorithms for regular domains and various domain embedding techniques. The fast algorithms for regular domains are derived from analysis of integral equation approach for solving elliptic ...
متن کاملMultidomain Local Fourier Method for PDEs in Complex Geometries
but with higher frequencies and amplitudes of the oscillating components), only a low accuracy can be achieved after an aaordable number of PCG iterations. The reason is that a strip-wise domain decomposition cannot handle large changes in non-constant coeecients in the lengthwise direction (see explanation at the end of section (5.1)). More general domain decompositions in the form of rectangu...
متن کاملA fast and simple method for modeling of oil swelling in Co2 injection
In this paper, the role of molecular diffusion in mobilization of waterflood residual oil is examined. A moving mesh method is applied to solve the moving interface problem of residual oil blobs swelling by Co2 diffusion through a blocking water phase. The results of this modeling are compared with experimental results of a 2D glass micromodel experiment. Although, the solution method is applie...
متن کاملFast and Simple Algorithms for Weighted Perfect Matching
We present two fast and simple combinatorial approximation algorithms for constructing a minimum-weighted perfect matching on complete graphs whose cost functions satisfy the triangle inequality. The first algorithm runs in O(n log n) time and is at most a factor logn worse than an optimal solution. In the second algorithm, the average time until a node is matched is O(n) and the approximation ...
متن کاملFast Approximation Algorithms for Art Gallery Problems in Simple Polygons
We present approximation algorithms with O(n) processing time for the minimum vertex and edge guard problems in simple polygons. It is improved from previous O(n) time algorithms of Ghosh. For simple polygon, there are O(n) visibility regions, thus any approximation algorithm for the set covering problem with approximation ratio of log(n) can be used for the approximation of n vertex and edge g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2007
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200700443